Sequential Monte Carlo simulated annealing

نویسندگان

  • Enlu Zhou
  • Xi Chen
چکیده

In this paper, we propose a population-based optimization algorithm, Sequential Monte Carlo Simulated Annealing (SMC-SA), for continuous global optimization. SMC-SA incorporates the sequential Monte Carlo method to track the converging sequence of Boltzmann distributions in simulated annealing. We prove an upper bound on the difference between the empirical distribution yielded by SMC-SA and the Boltzmann distribution, which gives guidance on the choice of the temperature cooling schedule and the number of samples used at each iteration. We also prove that SMC-SA is more preferable than the multi-start simulated annealing method when the sample size is sufficiently large.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Populatoin-based Simulated Annealing Algorithm

In this paper, we propose sequential Monte Carlo simulated annealing (SMC-SA), a populationbased simulated annealing algorithm, for continuous global optimization. SMC-SA incorporates the sequential Monte Carlo method to track the converging sequence of Boltzmann distributions in simulated annealing, such that the empirical distribution will converge weakly to the uniform distribution on the se...

متن کامل

Optimization of population annealing Monte Carlo for large-scale spin-glass simulations

Population annealing Monte Carlo is an efficient sequential algorithm for simulating k-local Boolean Hamiltonians. Because of its structure, the algorithm is inherently parallel and therefore well-suited for large-scale simulations of computationally hard problems. Here we present various ways of optimizing population annealing Monte Carlo using 2-local spin-glass Hamiltonians as a case study. ...

متن کامل

Constructing School Timetables using Simulated Annealing: Sequential and Parallel Algorithms

This paper considers a solution to the school timetabling problem. The timetabling problem involves scheduling a number of tuples, each consisting of class of students, a teacher, a subject and a room, to a fixed number of time slots. A Monte Carlo scheme called simulated annealing is used as an optimisation technique. The paper introduces the timetabling problem, and then describes the simulat...

متن کامل

MPSA: A Methodology to Parallelize Simulated Annealing and Its Application to the Traveling Salesman Problem

The Methodology to Parallelize Simulated Annealing (MPSA) leads to massive parallelization by executing each temperature cycle of the Simulated Annealing (SA) algorithm in parallel. The initial solution for each internal cycle is set through a Monte Carlo random sampling to adjust the Boltzmann distribution at the cycle beginning. MPSA uses an asynchronous communication scheme and any implement...

متن کامل

Window Annealing over Square Lattice Markov Random Field

Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more recent deterministic algorithms such as graph cuts and belief propagation hinders its popularity over the large dimensional Markov Random Field (MRF). In this paper, we propose a new efficient sampling-based optimizat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Global Optimization

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2013